Infix and Postfix

1. What is the correct precedence order for the operators used in this experiment?

\text{Priority}(\wedge) > \text{Priority}(/) > \text{Priority}(*) > \text{Priority}(+) \ge \text{Priority}(-)

Explanation

\text{Priority}(/) > \text{Priority}(\wedge) > \text{Priority}(*) > \text{Priority}(+) \ge \text{Priority}(-)

Explanation

\text{Priority}(\wedge) > \text{Priority}(*) > \text{Priority}(/) > \text{Priority}(+) \ge \text{Priority}(-)

Explanation

\text{Priority}(/) > \text{Priority}(*) > \text{Priority}(\wedge) > \text{Priority}(+) \ge \text{Priority}(-)

Explanation

2. During infix-to-postfix conversion using a stack, where are pending operators temporarily stored?

a: In the output expression Explanation

Explanation

b: In the operand list Explanation

Explanation

c: In the operator stack Explanation

Explanation

d: In the input expression permanently Explanation

Explanation

3. When an operand is encountered while converting an infix expression to postfix, what is normally done with it?

a: Push it onto the operator stack Explanation

Explanation

b: Append it directly to the postfix output Explanation

Explanation

c: Discard it until all operators are processed Explanation

Explanation

d: Replace it with the previous operator Explanation

Explanation

4. When an operator is read, why may operators already on the stack be popped before the new operator is pushed?

a: To preserve operator precedence and associativity in the postfix output Explanation

Explanation

b: To remove all operands from the expression Explanation

Explanation

c: To make the stack contain only operands Explanation

Explanation

d: To reverse the input expression Explanation

Explanation

5. What is done when a left parenthesis

(

is encountered during stack-based conversion?

a: It is appended immediately to the postfix output. Explanation

Explanation

b: It is ignored completely. Explanation

Explanation

c: It is placed on the operator stack. Explanation

Explanation

d: It causes every operand to be popped. Explanation

Explanation

6. What is the role of a right parenthesis

)

during infix-to-postfix conversion?

a: Push it onto the stack and leave it there. Explanation

Explanation

b: Pop operators to the output until the matching left parenthesis is found, then discard the pair of parentheses. Explanation

Explanation

c: Append the right parenthesis directly to the postfix output. Explanation

Explanation

d: Convert the right parenthesis into an operand. Explanation

Explanation

7. For the infix expression

a+b*c

, what postfix expression should a correct stack-based conversion produce?

a: ab+c* Explanation

Explanation

b: abc*+ Explanation

Explanation

c: a+bc* Explanation

Explanation

d: *abc+ Explanation

Explanation

8. In a standard stack-based infix-to-postfix algorithm, what should happen to the remaining operators after the entire input expression has been scanned?

a: They should be discarded. Explanation

Explanation

b: They should be converted into operands. Explanation

Explanation

c: They should be popped from the stack and appended to the postfix output, subject to valid-expression conditions. Explanation

Explanation

d: They should be pushed back into the input expression. Explanation

Explanation

9. What is the time complexity of scanning an infix expression of

n

tokens using a standard stack-based conversion algorithm, assuming each token is pushed and popped at most a constant number of times?

O(1)

Explanation

O(\log n)

Explanation

O(n)

Explanation

O(n^2)

Explanation